Ciphertext/plaintext and ciphertext/key dependence vs number of rounds for the data encryption standard

نویسنده

  • CARL H. MEYER
چکیده

One property of the Data Encryption Standard (DES) is that each bit of ciphertext is a complicated function of all plaintext bits and all key bits. A method is developed which evaluates how fast this dependence (defined as intersymbol dependence) builds up as a function of repeated mathematical operations called "rounds." It is shown that the minimum number of rounds to achieve intersymbol dependence for plairitext as well as key is five. Cryptography deals with the methods involved in preparing cryptograms-messages or writings intended to be incomprehensible to all except those who legitimately possess the means to recover the original information. The designer of a cryptographic system, or cryptosystem, is a cryptographer. The opponent or antagonist of a cryptosystem is a cryptanalyst. Cryptanalysis is concerned with techniques used to penetrate communications and recover the original information by means other than those available to the legitimate recipient. Cryptology is the science of disguised or secret communications. It embraces both cryptography and cryptanalysis. The basic challenge in cryptography is to devise a method that transforms messages (known as plaintext) into cryptograms (known as ciphertext) in a cryptographically secure way-that is, the method must withstand intense efforts of cryptanalysis. Plaintext can be protected by either of two techniques: it can be encoded using a code system, or it can be enciphered (encrypted) using a cipher System. Code systems require a code book or dictionary that relates the words, phrases, and sentences of the vocabulary (the plaintext) to its equivalent code group (the ciphertext), and vice versa. The number of plaintext messages that can be encoded depends on the number of combinations of phrases that can be obtained from the code book. Although that number may be large, not every combination or pattern of bits can be encoded. Hence the versatility and usefulness of code systems is limited, especially in computer applications, which would have to be programmed to handle all such exceptions.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Five-Round Algebraic Property of the Advanced Encryption Standard

Abstract. This paper presents a five-round algebraic property of the Advanced Encryption Standard (AES). In the proposed property, we modify twenty bytes from five intermediate values at some fixed locations in five consecutive rounds, and we show that after five rounds of operations, such modifications do not change the intermediate result and finally still produce the same ciphertext. We intr...

متن کامل

Security of the AES with a Secret S-Box

How does the security of the AES change when the S-box is replaced by a secret S-box, about which the adversary has no knowledge? Would it be safe to reduce the number of encryption rounds? In this paper, we demonstrate attacks based on integral cryptanalysis which allow to recover both the secret key and the secret S-box for respectively four, five, and six rounds of the AES. Despite the signi...

متن کامل

Chosen-Ciphertext Security of Multiple Encryption

Encryption of data using multiple, independent encryption schemes (“multiple encryption”) has been suggested in a variety of contexts, and can be used, for example, to protect against partial key exposure or cryptanalysis, or to enforce threshold access to data. Most prior work on this subject has focused on the security of multiple encryption against chosen-plaintext attacks, and has shown con...

متن کامل

On Ciphertext Undetectability

We propose a novel security notion for public-key encryption schemes – ciphertext undetectability. Informally, an encryption scheme has the property of ciphertext undetectability, if the attacker is unable to distinguish between valid and invalid ciphertexts. We compare this notion with the established ones, such as indistinguishability of ciphertexts and plaintext awareness. We analyze the pos...

متن کامل

Identity-Based Proxy Re-encryption

In a proxy re-encryption scheme a semi-trusted proxy converts a ciphertext for Alice into a ciphertext for Bob without seeing the underlying plaintext. A number of solutions have been proposed in the public-key setting. In this paper, we address the problem of Identity-Based proxy re-encryption, where ciphertexts are transformed from one identity to another. Our schemes are compatible with curr...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2010